基于使命和方法框架的武器装备体系结构建模

针对武器装备体系的特点,提出一种基于使命和方法框架(M iss ions and M eans F ram ew ork,MM F)的武器装备体系结构建模方法。MM F模型包含使命的确定、方法的分配和使命完成的评价。采用使命-方法框架对武器装备体系进行组织和描述。在自上而下的规划和决策过程中,实现了使命的确定和方法的分配,以数据要素的形式完成对武器装备体系结构模型的构建。并以"超地平线登陆"作战装备体系为例,验证了该方法的可行性。     

基于二元决策图的多阶段任务系统可靠性分析

分析了多阶段任务系统(PMS)可靠性分析中传统二元决策图(BDD)建模方法的不足,提出了一种将多阶段任务失效事件分解为互不相容的阶段失效事件,然后分别建立可靠性BDD模型的新方法。通过该方法建立的PMS可靠性BDD模型不但可以计算总体任务失效概率,同时也能计算任务在各阶段发生失效的概率。最后,给出了一个算例,验证了该算法的有效性。     

基于任务能力的装备维修保障资源重组研究

分析了装备维修保障资源配置存在的问题,指出依据装备维修保障系统承担的任务和应具备的能力实施资源重组,是提高装备维修保障效能的基本途径．在此基础上,着重阐述了装备维修保障任务、功能、资源映射关系,提出了部队装备维修保障资源重组的实施框架、主要内容和基本方法．最后,进行了实例分析．     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

复杂约束下的导弹作战任务规划模型和算法研究*

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题.首先通过定叉约束满足效用对基本约束满足模型进行了扩展,建立了导弹任务规划的约束满足优化模型.在此基础上,研究了任务规划模型求解的时间和效用传播算法,提出了基于综合效用的优化求解框架.该模型和求解框架易于解决具有多种约束因素的复杂问题,具有较好的通用性.通过定义软、硬约束效用,使得实际任务规划问题求解具有更好的灵活性.     

面向多星观测调度的分层迭代算法

提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。     

SpaceWire网络混合路由机制设计

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量;动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。     

一种基于目标的雷达对抗侦察策略

传统的电子战接收系统的搜索方式主要针对参数完全未知的敌方信号,通过在频域、空域等各维度进行大范围的逐段重复搜索可在较长时间内获得较好的侦察效果,但不适合短时间内对特定目标群的搜索和验证。针对电子战接收机存在的盲目侦察接收、与作战目标结合不紧密等问题,提出了一种基于作战目标的侦察策略,能够智能引导超外差接收机进行搜索截获,有效提升了超外差接收机对重点目标的实时截获与准确识别能力。     

面向任务的模块化战备方案修订及运用模式

针对当前信息技术发展的推进及部队使命任务的拓展和转型实际,对模块化战备方案研究现状进行了深入分析,面向作战任务,从任务、组织、专业和装备4个方面对模块化的战备方案进行了构建,对战备方案的运用流程进行了描述,而后以特种部队为案例,介绍了具体的模块组成,并引入反恐怖作战行动案例进行了合理性验证。通过模块化战备方案规划,保证不同情况任务模块的构造能力和组合能力,提高了战备方案的灵活性、适用性和可靠性。